Hamiltonian decompositions of complete regular s-partite graphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian decompositions of random bipartite regular graphs
We prove a complete hamiltonian decomposition theorem for random bipartite regular graphs, thereby verifying a conjecture of Robinson and Wormald. The main step is to prove contiguity (a kind of asymptotic equivalence) of two probabilistic models of 4-regular bipartite graphs; namely, the uniform model, and the model obtained by taking the union of two independent, uniformly chosen bipartite Ha...
متن کاملThe number of Hamiltonian decompositions of regular graphs
A Hamilton cycle in a graph Γ is a cycle passing through every vertex of Γ. A Hamiltonian decomposition of Γ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is Walecki’s theorem from the 19th century, showing that a complete graph Kn on an odd number of vertices n has a Hamiltonian decomposition. This result was recently greatly extended b...
متن کاملDecompositions of Complete Graphs into Bipartite 2-Regular Subgraphs
It is shown that if G is any bipartite 2-regular graph of order at most n2 or at least n − 2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order n into a perfect matching and edge-disjoint copies of G.
متن کاملIntegral complete r-partite graphs
A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that the problem of finding such integral graphs is equivalent to the problem of solving some Diophantin...
متن کاملSharp bounds for decompositions of graphs into complete r-partite subgraphs
If G is a graph on n vertices and r 2 2, we let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), we may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w e prove that m,(G) 2 log,(n + r l)/r. Furthermore, for each k 2 0 and r 2 2, there is a unique redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90186-x